Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
891	Automatic versus Human Navigation in Information Networks Robert West and Jure Leskovec Computer Science Department Stanford University {west, jure}@cs.stanford.edu Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2013-09-11 13:44:52 Theoretical computer science Network theory Combinatorial optimization Routing algorithms Binary trees A* search algorithm Breadth-first search Shortest path problem Semantic similarity Mathematics Graph theory Search algorithms
892	Math. Program., Ser. B 89: 273–[removed]Digital Object Identifier (DOI[removed]s101070000201 Fredrik Andersson · Helmut Mausser · Dan Rosen · Stanislav Uryasev Credit risk optimization with Conditional Value-at- Add to Reading List Source URL: www.ise.ufl.edu Language: English - Date: 2013-06-15 17:47:09 Financial risk Applied mathematics Mathematical finance Mathematical optimization Expected shortfall Econometrics Loss function Optimization problem Risk Statistics Actuarial science Mathematical sciences
893	RESEARCH FEATURE Self-Organization and Identification of Web Communities Despite its decentralized and unorganized nature, the Web self-organizes Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-12-04 14:11:42 Network flow Combinatorial optimization Search algorithms PageRank Cut Flow network Maximum flow problem Algorithm Hyperlink Mathematics Graph theory Theoretical computer science
894	Review of1 of The P = NP Question and Godel’s Lost Letter by Richard J. Lipton Springer, [removed]pages, Hardcover Review by Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2010-10-04 09:51:41 Complexity classes NP-complete problems Mathematical optimization Conjectures P versus NP problem Structural complexity theory NP Integer factorization Richard J. Lipton Theoretical computer science Computational complexity theory Applied mathematics
895	Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms TOM LEIGHTON Massachusetts Institute of Technology, Cambridge, Massachusetts AND Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:52 Network flow Combinatorial optimization Flow network Maximum flow problem Minimum cut Cut Max-flow min-cut theorem Connectivity Graph partition Mathematics Graph theory Theoretical computer science
896	Sparse Signal Reconstruction: LASSO and Cardinality Approaches Nikita Boyko, Gulver Karamemis, Viktor Kuzmenko, and Stan Uryasev Abstract The paper considers several optimization problem statements for signal sparse reco Add to Reading List Source URL: www.ise.ufl.edu Language: English - Date: 2014-06-24 12:36:20 Operations research Linear algebra Convex optimization Numerical linear algebra Linear programming CPLEX Compressed sensing Preconditioner Optimization problem Mathematics Algebra Mathematical optimization
897	The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed] Add to Reading List Source URL: www.cs.rit.edu Language: English - Date: 2003-06-11 09:35:55 Complexity classes NP-complete problems Operations research Mathematical optimization Spanning tree Travelling salesman problem Minimum spanning tree NP-hard NP-complete Theoretical computer science Computational complexity theory Applied mathematics
898	Energy-efficient Paths in Radio Networks⋆ Rene Beier1 , Stefan Funke1 , Domagoj Matijevi´c1 , and Peter Sanders2 1 2 Add to Reading List Source URL: bib.irb.hr Language: English - Date: 2011-01-25 16:40:10 Search algorithms Mathematical optimization Approximation algorithm Computational complexity theory Shortest path problem Nearest neighbor search Fractional cascading Dynamic programming Point location Mathematics Theoretical computer science Information science
899	Improved Generic Algorithms for Hard Knapsacks? Anja Becker1,?? , Jean-S´ebastien Coron3 , and Antoine Joux1,2 1 University of Versailles Saint-Quentin-en-Yvelines 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-08-31 08:22:53 NP-complete problems Combinatorial optimization Cryptography Knapsack problem Operations research Theoretical computer science Applied mathematics Dynamic programming
900	Distributed Biobjective Ant Colony Algorithm for Low Cost Overlay Network Routing Benjamin McBride Caterina Scoglio Add to Reading List Source URL: ece.k-state.edu Language: English - Date: 2007-03-31 14:48:09 Theoretical computer science Ant colony optimization algorithms Stochastic optimization Tapestry Routing Overlay network Pastry Travelling salesman problem Network topology Distributed data storage Computing Computer architecture

UPDATE